Evolutionary Optimization of Dynamic Multiobjective Functions
نویسندگان
چکیده
Many real-world problems show both multiobjective as well as dynamic characteristics. In order to use multiobjective evolutionary optimization algorithms (MOEA) efficiently, a systematic analysis of the behavior of these algorithms in dynamic environments is necessary. Dynamic fitness functions can be classified into problems with moving Pareto fronts and Pareto sets having varying speed, shape, and structure. The influence of the dimensions of the objective and decision space is considered. The analysis will focus on standard benchmark functions and newly designed test functions. Convergence and solution distribution features of modern MOEA, namely NSGA-II, SPEA 2 and MSOPS using different variation operators (SBX and Differential Evolution), will be characterized using Pareto front metrics. A new path integral metric is introduced. Especially the ability of the algorithms to use historically evolved population properties will be discussed.
منابع مشابه
Multiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کاملDesign und Management komplexer technischer Prozesse und Systeme mit Methoden der Computational Intelligence Evolutionary Optimization of Dynamic Multiobjective Functions
Many real-world problems show both multiobjective as well as dynamic characteristics. In order to use multiobjective evolutionary optimization algorithms (MOEA) efficiently, a systematic analysis of the behavior of these algorithms in dynamic environments is necessary. Dynamic fitness functions can be classified into problems with moving Pareto fronts and Pareto sets having varying speed, shape...
متن کاملThreshold Based Penalty Functions for Constrained Multiobjective Optimization
This paper compares the performance of our recently proposed threshold based penalty function against its dynamic and adaptive variants. These penalty functions are incorporated in the update and replacement scheme of the multiobjective evolutionary algorithm based on decomposition (MOEA/D) framework to solve constrained multiobjective optimization problems (CMOPs). As a result, the capability ...
متن کاملEffectiveness of Weighted Aggregation of Objectives for Evolutionary Multiobjective Optimization: Methods, Analysis and Applications
Multiobjective optimization using the conventional weighted aggregation of the objectives method is known to have several drawbacks. In this paper, multiobjective optimization using the weighted aggregation method is approached with the help of evolutionary algorithms. It is shown through a number of test functions that a Pareto front can be achieved from one single run of evolutionary optimiza...
متن کاملMultiobjective Optimization of Dynamic Processes by Evolutionary Methods
The real-world optimisation of dynamic processes, such as batch processes, space applications and robotic problems, is usually a matter of several objectives and constraints. In many cases it is difficult to deal with such problems with conventional methods. Evolutionary methods provide an interesting alternative, with less programming and computational efforts. This paper presents four Evoluti...
متن کامل